Asymptotic analysis of the exponential penalty trajectory in linear programming
نویسندگان
چکیده
We consider the linear program rain { c'x: Ax ~< b } and the associated exponential penalty function fr(x) = c'x + rEexp [ ( A ~ bi)/r]. For r close to 0, the unconstrained minimizer x(r) offr admits an asymptotic expansion of the form x (r) = x* + rd* + *l(r) where x* is a particular optimal solution of the linear program and the error term ~(r) has an exponentially fast decay. Using duality theory we exhibit an associated dual trajectory h(r) which converges exponentially fast to a particular dual optimal solution. These results are completed by an asymptotic analysis when r tends to ~: the primal trajectory has an asymptotic ray and the dual trajectory converges to an interior dual feasible solution. AMS Subject Classification: 90C05, 90C25, 90C31,49M30
منابع مشابه
Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملEffects of Probability Function on the Performance of Stochastic Programming
Stochastic programming is a valuable optimization tool where used when some or all of the design parameters of an optimization problem are defined by stochastic variables rather than by deterministic quantities. Depending on the nature of equations involved in the problem, a stochastic optimization problem is called a stochastic linear or nonlinear programming problem. In this paper,a stochasti...
متن کاملIntegrating Goal Programming, Taylor Series, Kuhn-Tucker Conditions, and Penalty Function Approaches to Solve Linear Fractional Bi-level Programming Problems
In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent...
متن کاملAsymptotic Convergence of the Steepest Descent Method for the Exponential Penalty in Linear Programming
u̇(t) = −∇xf(u(t), r(t)), u(t0) = u0 where f(x, r) is the exponential penalty function associated with the linear program min{c′x : Ax ≤ b}, and r(t) decreases to 0 as t goes to ∞. We show that for each initial condition (t0, u0) the solution u(t) is defined on the whole interval [t0,∞) and, under suitable hypothesis on the rate of decrease of r(t), we establish the convergence of u(t) towards a...
متن کاملUsing an Efficient Penalty Method for Solving Linear Least Square Problem with Nonlinear Constraints
In this paper, we use a penalty method for solving the linear least squares problem with nonlinear constraints. In each iteration of penalty methods for solving the problem, the calculation of projected Hessian matrix is required. Given that the objective function is linear least squares, projected Hessian matrix of the penalty function consists of two parts that the exact amount of a part of i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 67 شماره
صفحات -
تاریخ انتشار 1994